城市公交线网优化的线性模型

为了对现有公交线网进行优化,有效利用现有交通资源,解决城市交通问题,运用系统科学的思想,通过对城市公交线网优化的主要内容、优化原则、优化目标以及约束条件的分析,兼顾考虑乘客出行时间、公交线网密度和公交企业的利益以及公交线网的布局对整个城市的交通系统的影响,提出了优化目标的函数表达式及相应约束条件的数学表达式,建立了公交线网优化的线性模型,并给出了运用逐步筛选法对所提出的数学模型进行求解的方法。     

分段线性变参数控制在数字式自动找平控制系统中的应用

为了验证分段线性变参数控制在自动找平控制系统中的应用前景,对自动找平控制系统的结构、控制方式进行了介绍;分析了分段线性控制方式的工作原理及特点,在实验室建立了沥青混凝土摊铺机数字式自动找平控制系统试验台,设计了3套试验方案,即普通电磁阀方案、高速开关阀方案和分段线性控制方案;对这3种控制方案进行了试验比较,得出了在阶跃干扰作用下,3种控制方案的响应速度及产生超调时的超调量。结果表明:分段线性控制方案具有较快的响应速度,但在系统产生超调时,其超调量相对较大。     

基于航速调整的班轮燃油补给优化

燃油成本在班轮运营总成本中占有很大比重,燃油补给是影响航运公司班轮运营成本和效益的一项重要决策.基于航速调整策略,以班轮运营总成本最小化为目标,建立燃油补给混合整数非线性规划模型,运用分段线性逼近法对燃油消耗函数进行线性化处理,并设计了求解算法步骤.实例分析验证了模型和求解方法的有效性.结果表明,在航运市场需求低迷的情况下,船舶更适宜采取较低的航速,采取灵活的加油港策略或放宽船舶到港时间窗限制,能更为有效地降低燃油成本.     

粉喷桩施工技术在高速公路软基加固中的应用

文章结合某高速公路软基加固工程实例,介绍了粉喷桩软基加固处理施工的工艺流程及技术要点,并分析了影响粉喷桩软基加固施工的主要因素,提出了相应的质量控制措施。     

囊式空气弹簧机械阻抗特性研究

根据小幅振动的线性叠加原理将囊式空气弹簧分成几个简单的可解析计算的规则区域,结合线性空气波动理论求解出空气弹簧内部声压场的分布。根据弹性薄壳无矩理论推导出旋转壳体状态向量的一阶常微分矩阵方程,利用齐次扩容精细积分法推导出壳体的传递矩阵,结合动力平衡方程求出空气弹簧在位移谐波激励下所受到的激励力,进而得出其机械阻抗。算例结果表明该方法合理可行,为运用近似解析法分析空气弹簧的阻抗特性提供了一种新的思路。     

Liner shipping network design with emission control areas: A genetic algorithm-based approach

To curb emissions, containerized shipping lines face the traditional trade-off between cost and emissions (CO₂ and SO_x) reduction. This paper considers this element in the context of liner service design and proposes a mixed integer linear programming (MILP) model based on a multi-commodity pickup and delivery arc-flow formulation. The objective is to maximize the profit by selecting the ports to be visited, the sequence of port visit, the cargo flows between ports, as well as the number/operating speeds of vessels on each arc of the selected route. The problem also considers that Emission Control Areas (ECAs) exist in the liner network and accounts for the vessel carrying capacity. In addition to using the MILP solver of CPLEX, we develop in the paper a specific genetic algorithm (GA) based heuristic and show that it gives the possibility to reach an optimal solution when solving large size instances.     

An optimal data-splitting algorithm for aircraft scheduling on a single runway to maximize throughput

In this research, we present a data-splitting algorithm to optimally solve the aircraft sequencing problem (ASP) on a single runway under both segregated and mixed-mode of operation. This problem is formulated as a 0–1 mixed-integer program (MIP), taking into account several realistic constraints, including safety separation standards, wide time-windows, and constrained position shifting, with the objective of maximizing the total throughput. Varied scenarios of large scale realistic instances of this problem, which is NP-hard in general, are computationally difficult to solve with the direct use of commercial solver as well as existing state-of-the-art dynamic programming method. The design of the algorithm is based on a recently introduced data-splitting algorithm which uses the divide-and-conquer paradigm, wherein the given set of flights is divided into several disjoint subsets, each of which is optimized using 0–1 MIP while ensuring the optimality of the entire set. Computational results show that the difficult instances can be solved in real-time and the solution is efficient in comparison to the commercial solver and dynamic programming, using both sequential, as well as parallel, implementation of this pleasingly parallel algorithm.